Approximate Geometric Pattern Matching Under Rigid Motions
نویسندگان
چکیده
We present techniques for matching point-sets in two and three dimensions under rigid-body transformations. We prove bounds on the worst-case performance of these algorithms to be within a small constant factor of optimal, and conduct experiments to show that the average performance of these matching algorithms is often better than that predicted by the worst-case bounds.
منابع مشابه
Probabilistic matching of sets of polygonal curves∗
Analysis and comparison of geometric shapes are of importance in various application areas within computer science, e.g., pattern recognition and computer vision. The general situation in a shape matching problem is that we are given two shapes A and B and a certain class T of allowable transformations and we want to transform B optimally so that the transformed image of B is as close to A as p...
متن کاملTransformation Hashing: An Efficient Point Pattern Matching Scheme
Point pattern matching problems are of fundamental importance in various areas including computer vision and structural bioinformatics. In this paper, we study one of the more general problems, known as the largest common point set problem (LCP) under approximate congruence: given two point sets M and Q in R, and a tolerance parameter ǫ ≥ 0, the problem is to find a rigid motion μ such that the...
متن کاملGeometric hybrid registration
Geometric matching problems are among the most intensely studied fields in Computational Geometry. A geometric matching problem can be formulated as follows: given are two geometric objects P and Q. These objects are taken from a class of geometric objects G and P is called the pattern and Q is called the model. A geometric matching instance is defined for a distance measure distG : G GÑ R and ...
متن کاملProbabilistic matching of solids in arbitrary dimension
We give simple probabilistic algorithms that approximately maximize the volume of overlap of two solid shapes under translations and rigid motions. The shapes are subsets of R, d ≥ 2. The algorithms approximate w.r.t. an prespecified additive error and succeed with high probability. Apart from measurability assumptions, we only require from the shapes that uniformly distributed random points ca...
متن کاملMinimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions
Matching geometric objects with respect to their Hausdorff distance is a well investigated problem in Computational Geometry with various application areas. The variant investigated in this paper is motivated by the problem of determining a matching (in this context also called registration) for neurosurgical operations. The task is, given a sequence P of weighted point sets (anatomic landmarks...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Pattern Anal. Mach. Intell.
دوره 21 شماره
صفحات -
تاریخ انتشار 1999